A Comparison between a Direct and a Multigrid Sparse Linear Solvers for Highly Heterogeneous Flux Computations

نویسندگان

  • A. Beaudoin
  • J.-R. de Dreuzy
  • J. Erhel
چکیده

Subsurface hydraulic properties are mainly governed by the heterogeneity of the porous medium considered. Our work aims at characterizing the asymptotic dispersion coefficients for highly heterogeneous permeability fields triggered by advection and constant local dispersion-diffusion. We have developed a fully parallel software for simulating flow and transport. We have compared two well-known sparse linear solvers, based respectively on a multifrontal Cholesky factorization and an iterative structured multigrid method. We study the effect of various parameters, mainly the system size, the number of processors and the degree of heterogeneity of the permeability field.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combinatorial problems in solving linear systems

Numerical linear algebra and combinatorial optimization are vast subjects; as is their interaction. In virtually all cases there should be a notion of sparsity for a combinatorial problem to arise. Sparse matrices therefore form the basis of the interaction of these two seemingly disparate subjects. As the core of many of today’s numerical linear algebra computations consists of the solution of...

متن کامل

The GPU as Numerical Simulation Engine

Many computer graphics applications require high-intensity numerical simulation. The question arises whether such computations can be performed efficiently on the GPU, which has emerged as a full function streaming processor with high floating point performance. We show in this paper that this is indeed the case using two basic, broadly useful, computational kernels as examples. The first is a ...

متن کامل

Efficient Linear System Solvers for Mesh Processing

The use of polygonal mesh representations for freeform geometry enables the formulation of many important geometry processing tasks as the solution of one or several linear systems. As a consequence, the key ingredient for efficient algorithms is a fast procedure to solve linear systems. A large class of standard problems can further be shown to lead more specifically to sparse, symmetric, and ...

متن کامل

Terascale Optimal PDE Simulations (TOPS), An Enabling Technology Center Scientific Discovery Through Advanced Computing: Integrated Software Infrastructure Centers

iii 1 Background and Significance 1 2 Preliminary Studies 3 2.1 PDE Time Integrators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 PDE Nonlinear Solvers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.3 PDE-constrained Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.4 Linear Solvers . . . ...

متن کامل

Performance of H-LU Preconditioning for Sparse Matrices

In this paper we review the technique of hierarchical matrices and put it into the context of black-box solvers for large linear systems. Numerical examples for several classes of problems from medium to large scale illustrate the applicability and efficiency of this technique. We compare the results with those of several direct solvers (which typically scale quadratically in the matrix size) a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006